A Scalable and Reconfigurable Fault-Tolerant Distributed Routing Algorithm for NoCs
نویسندگان
چکیده
منابع مشابه
Fault-tolerant Routing Scheme for Nocs
A NoC architecture offers high reliability since it has multiple routes from the host to clients. A fault tolerant NoC framework is proposed which achieves maximum performance under fault. NoCs under fault become totally unfunctional. Hence the faulty components are handled separately which ensure that the network is not partitioned and results in high connectivity even under high fault. NoCs a...
متن کاملAnalyzing and Exploring Fault-tolerant Distributed Memories for NoCs
Advances in technology scaling increasingly make Network-on-Chips (NoCs) more susceptible to failures that cause various reliability challenges. With increasing area occupied by different on-chip memories, strategies for maintaining faulttolerance of distributed on-chip memories become a major design challenge. We propose a system-level design methodology for scalable fault-tolerance of distrib...
متن کاملA Fault Resilient Routing Algorithm for Sparsely Connected 3D NoCs
3D NoC has its outstanding advantages over 2D design such as the smaller footprint and the shorter global interconnects. However, vertical interconnects are expensive and prone to faults. It implies that 3D NoCs might be sparsely connected. Such non-fully connected 3D NoCs require proper routing algorithms to support the limited number of TSVs in the network where traditional algorithms such as...
متن کاملDistributed Fault-tolerant Routing in a Hypercube
A ABSTRACT connected hypercube containing faulty nodes/links is called an injured hypercube, f whereas a hypercube without faulty components is called a healthy hypercube. To allow non-aulty nodes in an injured hypercube to communicate with one another, each hypercube node has to be equipped with enough information so as to make correct routing decisions, and 1 y c update the information whenev...
متن کاملSystem Description for a Scalable, Fault-Tolerant, Distributed Garbage Collector
We describe an efficient and fault-tolerant algorithm for distributed cyclic garbage collection. The algorithm imposes few requirements on the local machines and allows for flexibility in the choice of local collector and distributed acyclic garbage collector to use with it. We have emphasized reducing the number and size of network messages without sacrificing the promptness of collection thro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2011
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e94.d.1386